Nesting and Berth Allocation by an Expert System Using Heuristic Search
نویسندگان
چکیده
منابع مشابه
Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated ...
متن کاملan investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols
this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...
Models and Tabu Search Heuristics for the Berth-Allocation Problem
In the Berth Allocation Problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete c...
متن کاملAN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...
متن کاملVariable neighborhood search for minimum cost berth allocation
The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering and Applications
سال: 2017
ISSN: 1945-3116,1945-3124
DOI: 10.4236/jsea.2017.104018